Improved Approximations of Independent Dominating Set in Bounded Degree Graphs
نویسندگان
چکیده
We consider the problem of nding an independent dominating set of minimum cardinality in bounded degree and regular graphs. We rst give an approximation algorithm for at most cubic graphs, that achieves ratio 2, based on greedy and local search techniques. We then propose an heuristic based on an iterative application of the greedy technique on graphs of lower and lower degree. When the graph is at most cubic, a local search phase is executed in order to improve the performance.
منابع مشابه
Complexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملOnline Dominating Set and Variations on Restricted Graph Classes
We study online versions ofMinimum Dominating Set Min imum Connected Dominating Set andMinimum Independent Dom inating Set where we restrict the input graphs to belong to a certain graph class after each insertion step We show that straight forward and easy to implement online strategies achieve optimum or nearly optimum competitive ratios for trees unit disk graphs and bounded degree graphs fo...
متن کاملApproximations of Independent Set Variants and Hereditary Subset Problems
The focus of this study is to clarify the approximability of the important versions of the maximum independent set problem, and to apply, where possible, the technique to related hereditary subgraph and subset problem. We report improved performance ratios for the Independent Set problem in weighted general graphs, weighted bounded-degree graphs, and in sparse graphs. Other problems with better...
متن کامل